Large Sieve Inequalities for GL(n)-forms In the Conductor Aspect
نویسنده
چکیده
Duke and Kowalski in [6] derive a large sieve inequality for automorphic forms on GL(n) via the Rankin-Selberg method. We give here a partial complement to this result: using some explicit geometry of fundamental regions, we prove a large sieve inequality yielding sharp results in a region distinct to that in [6]. As an application, we give a generalization to GL(n) of Duke’s multiplicity theorem from [5]; we also establish basic estimates on Fourier coefficients of GL(n) forms by computing the ramified factors for GL(n)×GL(n) Rankin-Selberg integrals.
منابع مشابه
Variants of Recognition Problems for Modular Forms
We consider the problem of distinguishing two modular forms, or two elliptic curves, by looking at the coefficients of their L-functions for small primes (compared to their conductor). Using analytic methods based on large-sieve type inequalities we give various upper bounds on the number of forms having the first few coefficients equal to those of a fixed one. In addition, we consider similar ...
متن کاملAmplification Arguments for Large Sieve Inequalities
We give a new proof of the arithmetic large sieve inequality based on an amplification argument, and use a similar method to prove a new sieve inequality for classical holomorphic cusp forms. A sample application of the latter is also given. 1. The classical large sieve The classical arithmetic large sieve inequality states that, for any real numbers N , Q > 1, any choice of subsets Ωp ⊂ Z/pZ f...
متن کاملBilinear Forms with Gl 3 Kloosterman Sums and the Spectral Large Sieve
We analyze certain bilinear forms involving GL3 Kloosterman sums. As an application, we obtain an improved estimate for the GL3 spectral large sieve inequality.
متن کاملAN EXPLICIT CONDUCTOR FORMULA FOR GL(n)×GL(1) AND FUNCTORIAL DEPTH PRESERVATION
We prove an explicit formula for the conductor of an irreducible, admissible representation of GL(n, F ) twisted by a character of F× where the field F is local and non-archimedean. The components of our formula are analysed, both explicitly and on average, for application to the analytic study of automorphic forms on GL(n). We also demonstrate that “functoriality preserves depth” for such Rank...
متن کاملGlobal conjugate gradient method for solving large general Sylvester matrix equation
In this paper, an iterative method is proposed for solving large general Sylvester matrix equation $AXB+CXD = E$, where $A in R^{ntimes n}$ , $C in R^{ntimes n}$ , $B in R^{stimes s}$ and $D in R^{stimes s}$ are given matrices and $X in R^{stimes s}$ is the unknown matrix. We present a global conjugate gradient (GL-CG) algo- rithm for solving linear system of equations with multiple right-han...
متن کامل